Formal verification of simulations between I / O automata
نویسندگان
چکیده
This thesis presents a tool for validating descriptions of distributed algorithms in the IOA language using an interactive theorem prover. The tool translates IOA programs into Larch Shared Language specifications in a style which is suitable for formal reasoning. The framework supports two common strategies for establishing the correctness of distributed algorithms: Invariants and simulation relations. These strategies are used to verify three distributed data management algorithms: A strong caching algorithm, a majority voting algorithm and Lamport's replicated state machine algorithm. Thesis Supervisor: Stephen J. Garland Title: Principal Research Scientist Thesis Supervisor: Nancy A. Lynch Title: NEC Professor of Software Science and Engineering
منابع مشابه
FORMAL VERIFICATION OF CHI MODELS USING PHAVer
The hybrid Chi (χ) language is a formalism for modeling, simulation and verification of hybrid systems. One of the most widely known hybrid system formalisms is that of hybrid automata. The formal translation of χ to hybrid automata enables verification of χ specifications using existing hybrid automata based verification tools. In this paper, we describe the translation from χ to hybrid automa...
متن کاملEquivalent Semantic Translation from Parallel DEVS Models to Time Automata
Dynamic reconfigurable simulation based on Discrete Event System Specification (DEVS) requires efficient verification of simulation models. Traditional verification method of DEVS model is based on I/O test in which a DEVS model is regarded as a black box or a grey box. This method is low efficient and insufficient because input samples are often limited. This paper proposes a formal method whi...
متن کاملCompositional Reasoning for Shared-variable Concurrent Programs
Scalable and automatic formal verification for concurrent systems is always demanding, but yet to be developed. In this paper, we propose a verification framework to support automated compositional reasoning for concurrent programs with shared variables. Our framework models concurrent programs as succinct automata and supports the verification of multiple important properties. Safety verificat...
متن کاملSpecifying and Verifying External Behaviour of Fair Input/Output Automata by Using the Temporal Logic of Actions
Fair input/output (or I/O) automata are a state-machine model for specifying and verifying reactive and concurrent systems. For the verification purposes, one is usually interested only in the sequences of interactions fair I/O automata offer to their environment. These sequences are called fair traces. The usual approach to the verification consists in proving fair trace inclusion between fair...
متن کاملThe Bakery Protocol : A Comparative Case - Study in Formal Veri cationW
REPORTRAPPORT The bakery protocol: a comparative case-study in formal verification Abstract Groote and the second author veriied (a version of) the Bakery Protocol in CRL. Their process-algebraic veriication is rather complex compared to the protocol. Now the question is: How do other veriication techniques perform on this protocol? In this paper, we present a new correctness proof by using I/O...
متن کامل